翻訳と辞書 |
cylindric numbering : ウィキペディア英語版 | cylindric numbering
In computability theory a cylindric numbering is a special kind of numbering first introduced by Yuri L. Ershov in 1973. If a numberings is reducible to then there exists a computable function with . Usually is not injective but if is a cylindric numbering we can always find an injective . == Definition ==
A numbering is called cylindric if : That is if it is one-equivalent to its cylindrification A set is called cylindric if its indicator function : is a cylindric numbering.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「cylindric numbering」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|